An Iterated Subdivision Algorithm for Procedural Road Plan Generation
نویسندگان
چکیده
The generation of detailed virtual environments is an increasingly resource-consuming task for videogame developers. This has encouraged the investigation of procedural techniques for creating content from landscapes to textures to—much more recently—cities and their constituent road-scapes. This paper introduces the Iterated Subdivision algorithm, a straightforward, flexible, and easily customised approach to the generation of road plans for virtual cities. The use of such an algorithm results in a significant savings in terms of developer time and resources—extending the possible scope of games— and furthermore allows rapid prototyping in order to test newly-created game assets.
منابع مشابه
An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria
In this paper, we propose an iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time minimization objective. The steps of this algorithm are designed very efficient. For generating an initial solution, we develop an efficient constructive heuristic by modifying the best known NEH algorithm. Effectiveness of the proposed iterated greedy algorithm is t...
متن کاملAn Iterated Greedy Algorithm for Flexible Flow Lines with Sequence Dependent Setup Times to Minimize Total Weighted Completion Time
This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...
متن کاملIJCAI ’ 95 Workshop on the Next Generation of Plan Recognition Systems p . 72 - 77 Procedural Agent Model for Plan
We propose a formal procedure-based agent model for plan recognition as an alternative to the declarative proposition-based agent model. Our formalism, called the Procedural Agent Model (PAM) allows us to describe procedural plans of agents in a concise and abstract way. Plan recognition uses PAM as a library of plan schemas and applies a graph-based pattern-matching algorithm to the observed e...
متن کاملArda: a Framework for Procedural Video Game Content Generation
The current trend in computer game design is toward larger and richer virtual worlds, providing interesting and abundant game content for players to explore. The creation and continuous expansion of detailed virtual environments, however, is a time and resource-consuming task for game developers. Procedural content generation potentially solves this problem; textures, landscapes, and more recen...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کامل